//
// Created by user on 2022/2/21.
//
#include <vector>
#include <algorithm>
using namespace std;

int maximumGap(vector<int>& nums) {
    sort(nums.begin(), nums.end());
    int gap = 0;
    for (int i = 0; i < nums.size()-1; ++i) {
        gap = max(nums[i+1]-nums[i]);
    }
    return gap;
}

//ji'shu